Correlation lower bounds from correlation upper bounds

نویسندگان

  • Shiteng Chen
  • Periklis A. Papakonstantinou
چکیده

We show that for any coprime m, r there is a circuit of the form MODm ◦ ANDd(n) whose correlation with MODr is at least 2 −O( n d(n) ). This is the first correlation lower bound for arbitrary m, r, whereas previously lower bounds were known for prime m. Our motivation is the question posed by Green et al. [11] to which the 2( n d(n) ) bound is a partial negative answer. We first show a 2−Ω(n) correlation upper bound that implies a 2 circuit size lower bound. Then, through a reduction we obtain a 2 n d(n) ) correlation lower bound. In fact, the 2 size lower bound is for MAJ ◦ANYo(n) ◦AND ◦MODr ◦ANDO(1) circuits, which can be of independent interest.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Upper and lower bounds of symmetric division deg index

Symmetric Division Deg index is one of the 148 discrete Adriatic indices that showed good predictive properties on the testing sets provided by International Academy of Mathematical Chemistry. Symmetric Division Deg index is defined by $$ SDD(G) = sumE left( frac{min{d_u,d_v}}{max{d_u,d_v}} + frac{max{d_u,d_v}}{min{d_u,d_v}} right), $$ where $d_i$ is the degree of vertex $i$ in graph $G$. In th...

متن کامل

Estimating ‎U‎pper and Lower Bounds For Industry Efficiency With Unknown ‎Technology‎

With a brief review of the studies on the industry in Data Envelopment Analysis (DEA) framework, the present paper proposes inner and outer technologies when only some basic information is available about the technology. Furthermore, applying Linear Programming techniques, it also determines lower and upper bounds for directional distance function (DDF) measure, overall and allocative efficienc...

متن کامل

Strong exponent bounds for the local Rankin-Selberg convolution

Let $F$ be a non-Archimedean locally compact field‎. ‎Let $sigma$ and $tau$ be finite-dimensional representations of the Weil-Deligne group of $F$‎. ‎We give strong upper and lower bounds for the Artin and Swan exponents of $sigmaotimestau$ in terms of those of $sigma$ and $tau$‎. ‎We give a different lower bound in terms of $sigmaotimeschecksigma$ and $tauotimeschecktau$‎. ‎Using the Langlands...

متن کامل

Bounds for the Distance to the Nearest Correlation Matrix

In a wide range of practical problems correlation matrices are formed in such a way that, while symmetry and a unit diagonal are assured, they may lack semidefiniteness. We derive a variety of new upper bounds for the distance from an arbitrary symmetric matrix to the nearest correlation matrix. The bounds are of two main classes: those based on the eigensystem and those based on a modified Cho...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electronic Colloquium on Computational Complexity (ECCC)

دوره 22  شماره 

صفحات  -

تاریخ انتشار 2015